#include <stdio.h>
#include <math.h>
#include <algorithm>
using namespace std;

#define TRACE(x...) 
#define PRINT(x...) TRACE(printf(x))

typedef struct {
	int x, y;
} Pt;

int l, c;
int r1, r2;
double dist;
Pt c1, c2;
int dx, dy;

int main() {
	while (1) {
		scanf("%d %d %d %d", &l, &c, &r1, &r2);
		
		if (!l && !c && !r1 && !r2) break;
		
		c1.x = r1;
		c1.y = r1;

		c2.x = l-r2;
		c2.y = c-r2;

		dx = c1.x - c2.x;
		dy = c1.y - c2.y;

		dist =  sqrt(dx*dx + dy*dy);

		PRINT("%lf\n", dist);		

		if (dist>=(r1+r2) && min(l,c) >= 2*max(r1,r2)) printf("S\n");
		else printf("N\n");
	}

	return 0;
}
